An orbital construction of optimum distance flag codes
نویسندگان
چکیده
Flag codes are multishot network consisting of sequences nested subspaces (flags) a vector space Fqn, where q is prime power and Fq, the finite field size q. In this paper we study construction on Fq2k full flag having maximum distance (optimum codes) that can be endowed with an orbital structure provided by action subgroup general linear group. More precisely, starting from subspace code dimension k given description, provide sufficient conditions to get optimum directly induced previous one. particular, exhibit specific best possible planar spread strongly depends characteristic field.
منابع مشابه
Geometric Construction Codes of Hamming Distance-8
A new high rate binary linear block code construction technique, named as Geometric Construction (GC) codes, was proposed recently [1]. It generates all the even full information rate (optimal) Hamming distance – 4 codes. In this paper, we have enhanced the construction of GC codes with respect to code rate and derived a code family of hamming distance-8 GC codes.
متن کاملOptimal subcodes and optimum distance profiles of self-dual codes
Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was introduced by Luo, et. al. (2010). One of our main results is the development of general algorithms, called the Chain Algorithms, for finding ODPs of linear codes...
متن کاملOptimum Subcodes of Self-Dual Codes and Their Optimum Distance Profiles
Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was introduced by Luo, et. al. (2010). One of our main results is the development of general algorithms, called the Chain Algorithms, for finding ODPs of linear codes...
متن کاملConstruction of Self-Dual Radical 2-Codes of given Distance
A linear code C is called a group code if C is an ideal in a group algebra K[G] where K is a ring and G is a finite group. Many classical linear error-correcting codes can be realized as ideals of group algebras. Berman [1], in the case of characteristic 2, and Charpin [2], for characteristic p = 2, proved that all generalized Reed–Muller codes coincide with powers of the radical of the group a...
متن کاملFurther results on binary convolutional codes with an optimum distance profile (Corresp.)
In a previous correspondence,’ a decoding procedurewhich uses continued fractions and which is applicable to a wideclass of algebraic codes including Goppa codes was presented. Theefficiency of this method is significantly increased. The efficiency of the decoding method in the above corre-spondencel can be significantly increased. In the following, allreferences will be to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2021
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2021.101861